A new exact algorithm for the Weapon-Target Assignment problem
نویسندگان
چکیده
The Weapon-Target Assignment (WTA) problem is of military importance; it computes an optimal assignment m weapons to n targets such that the expected total damage maximized (or equivalently, survival possibility minimized). WTA known be NP-complete and was commonly formulated as nonlinear models. In previous studies, largest instances could solved exactly were only moderate sizes (e.g., 80 targets, with a long execution time 16.2 h). this paper, unlike methods tackled models, we formulate linear model, present new exact algorithm much more efficient for solving problem. More specifically, our formulates integer programming model which has binary columns, solves using column enumeration well branch bound techniques. To drastically reduce number columns needed enumerated, propose called weapon bounding domination. Extensive computational experiments are conducted, results show can solve all considered by studies but solutions take shorter time. particular, instance 0.40 s. Furthermore, larger than methods, maximum size up 400 average 4.68 addition, method extended applicable Assets Tasks (AATT)
منابع مشابه
Exact and Heuristic Methods for the Weapon Target Assignment Problem
The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...
متن کاملExact and Heuristic Algorithms for the Weapon-Target Assignment Problem
The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولACGA Algorithm of Solving Weapon - Target Assignment Problem
Weapon Target Assignment is not only an important issue to use firepower, but also an important operational decision-making problem. As new intelligent algorithms, Genetic algorithm and ant colony algorithm are applied to solve Weapons-Target Assignment Problem. This paper introduces the Weapon-Target Assignment (WTA) and the mathematical model, and proposes ACGA algorithm which is the integrat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2021
ISSN: ['1873-5274', '0305-0483']
DOI: https://doi.org/10.1016/j.omega.2019.102138